On Solutions of the Diophantine Equation 8^x + 9^y = z^2 when x, y, z are Positive Integers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Diophantine Equation 8x + py = z2

Let p be a fixed odd prime. Using certain results of exponential Diophantine equations, we prove that (i) if p ≡ ± 3(mod  8), then the equation 8 (x) + p (y) = z (2) has no positive integer solutions (x, y, z); (ii) if p ≡ 7(mod  8), then the equation has only the solutions (p, x, y, z) = (2 (q) - 1, (1/3)(q + 2), 2, 2 (q) + 1), where q is an odd prime with q ≡ 1(mod  3); (iii) if p ≡ 1(mod  8)...

متن کامل

ON THE DIOPHANTINE EQUATION x + y = 2pz

We show, if p is prime, that the equation xn + yn = 2pz2 has no solutions in coprime integers x and y with |xy| ≥ 1 and n > p132p , and, if p 6= 7, the equation xn + yn = pz2 has no solutions in coprime integers x and y with |xy| ≥ 1 and n > p12p .

متن کامل

On the Diophantine Equation x^6+ky^3=z^6+kw^3

Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...

متن کامل

ON THE DIOPHANTINE EQUATION x p − x = y q −

We consider the diophantine equation (∗) x − x = y − y in integers (x, p, y, q). We prove that for given p and q with 2 ≤ p < q (∗) has only finitely many solutions. Assuming the abcconjecture we can prove that p and q are bounded. In the special case p = 2 and y a prime power we are able to solve (∗) completely.

متن کامل

The Diophantine equation f(x) = g(y)

have finitely or infinitely many solutions in rational integers x and y? Due to the classical theorem of Siegel (see Theorem 10.1 below), the finiteness problem for (1), and even for a more general equation F (x, y) = 0 with F (x, y) ∈ Z[x, y], is decidable (). One has to: • decompose the polynomial F (x, y) into Q-irreducible factors; • for those factors which are not Q-reducible, determine th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Mathematics

سال: 2019

ISSN: 2279-087X,2279-0888

DOI: 10.22457/apam.641v20n2a6